Image Underst anding System
نویسنده
چکیده
Prime Component Decomposition of Images and its Applications in an Image Underst anding System Maciej Macieszczak, Ph-D. Concordia University, 1997 A reliable and flexible model of a low-level processing stage is one of the most crucial requirements in the development of an image understanding system (IUS). In this thesis, a model for the low-level processing stage based on a new scheme of prime component decomposition is proposed. This model is then used to develop a knowledge-based image understanding system that is capable of solving many image processing problems without employing complex algorithms. .4 scheme for the prime component decomposition that utilizes the maximum size geometrical polygons is devised. It is shown that the optimal decomposition element in the continuous metric space has a circular shape. The decomposition operator is also optimized in the discrete metric space to deal with the actual implementation of the prime component decomposition operator, yielding square decomposition elements. The derived decomposition operator is used to extract shape elements of the objects contained in input scenes and to produce their intermediate object descriptions. In the proposed approach of shape extraction, the prime component decomposition technique is used to partition the object's interior, while a modified Sobel operator is used to detect the object's edges. The typical errors of a shape extraction process such as noise sensitivity, description errors of diagonal objects and the description errors caused by a small sampling frequency are reduced using a shape equalization approach that is based on Fourier descriptors and nonlinear interpolation. In the development of an image understanding system, a hierarchical approach of constructing the intermediate object representation is used to represent the knowledge within the system. The knowledge base of the IUS is developed as a relational mdtidimensional tree structure that dynamically changes the relational links among its elements. The dynamical process of creating and transforming the knowledge base is controlled by a feedback with the low-level processing stage that reduces the memory requirements of the IUS. The traditional data type definitions are extended to include the base and derived data types. These extensions effectively represent and process the time-varying knowledge of the system and increase its overall efficiency. The high-level processing stage of the IUS is implemented based on the black-board architecture with a specialized control mechanism the agenda-based control. This control mechanism reduces the number of computational steps within the high-level processing stage by employing a selective focusing mechanism. The functionaI behaviour of the proposed prime component decomposition scheme and the model of the image understanding system is experimented with several application examples including the isolation and identification of stationary and time-varying objects.
منابع مشابه
Active camera controlling for manipulation
This paper introduces a method for object manipulation using an active camera. By actively moving camera to proper positions with desired viewing angle from objects of interest, we can acquire good data to realize a robust. visual feedback control.of a robot. This approach avoids complicate 3D modeling and image processing carried out is driven by tasks. We focus on active camera control for ro...
متن کاملA toolset for the reengineering of complex computer systems
This paper describes a set of tools for the reengineering of computer-based systems, in particular software. The toolset is based on an abstract intermediate representation (IR) which incorporates the system software architecture at five levels of granularity: program level, task level, package/object instance level, subprogram level and statement level. The toolset provides a graphical user in...
متن کاملGenetic Algorithms and the Variance of Fitness
This paper presents a method for calculat ing the variance of schema fitness using Walsh t ransforms. The computation is important for underst anding the performance of genet ic algorithms (GAs) because most GAs depend on the sam pling of schema fitness in populat ions of modest size, and the variance of schema fitn ess is a primary source of noise that can prevent proper evaluation of building...
متن کاملRobust Quasihomoge neous Configuratio ns III Coupled Map
We st udy t he evolution of a coupled map la t t ice in two dimensions with st rong coupling. We show t he tenden cy of such system to ass ume (quas i) homogeneous space configur a t ions evolving in time. We describe the mechanism of t his phenomen on. Coupled Map Lat ti ces (CM Ls), which were int roduced rather recently [1, 2], now serve as one of the most useful and powerful instruments for...
متن کاملUsing Contrapositives to Enhance the Implication Graphs of Logic Circuits
Implication graphs are used to solve the test generation, redundancy identification, synthesis, and verification problems of digital circuits. We propose a new “oring” node structure to represent partial implications in a graph. The oring node is the contrapositive of the previously used “anding” node. The addition of a single oring node in the implication graph of a Boolean gate eliminates the...
متن کامل